CS / Math 240 : Introduction to Discrete Mathematics Fall 2015 Reading 4 : Proofs

Making Formal Methods Popular: The Crux is Math Education!

Although on many occasions, especially at FM conferences, highlights of the use of Formal Methods in software development are presented, FM plays just a minor role in both the everyday work of software engineers as well as Computer Science and Software Engineering curricula. To me, one of the main reasons for the status quo is that mathematics education, as it is usually done today, does not en...

Reading 5 : Induction

In the last reading we began discussing proofs. We mentioned some proof paradigms that are generally applicable. For implications, we saw how to write a direct proof and an indirect proof. We saw how to prove equivalences by proving two implications and by constructing a chain of equivalences. We also saw two techniques applicable to proofs of any statements, namely proof by contradiction and p...

CS 229r Notes

A lot of the course material is new, within the last 10 years, and since the area is so ripe for contributions, the project will be cutting-edge. There are three possible routes: Make a theoretical contribution to some topic in the course; write a survey covering many related papers in an area (one option is to be risky and try to make a contribution and fall back on a survey if you’re not succ...

Notes on Discrete Mathematics CS 202 : Fall 2013

Two Frameworks for Discrete Mathematics

Information Systems and Computer Science educators have campaigned to increase mathematical content in the computing curriculum. Unfortunately, mathematical concepts are often presented in a manner that conflicts with the general mental framework, or gestalt, of IS and CS students. However, there is more than one gestalt in mathematics. In previous research, we developed two scales for measurin...